On polynomial approximation for strictly stationary processes.

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Almost Sure Central Limit Theorem for Strictly Stationary Processes

On any aperiodic measure preserving system, there exists a square integrable function such that the associated stationary process satifies the Almost Sure Central Limit Theorem. Introduction The Almost Sure Central Limit Theorem (ASCLT), first formulated by Lévy in [9], has been studied by various authors at the end of the eighties ([6], [3], [10], [8]). This theorem gives conditions under whic...

متن کامل

A weak approximation for the Extrema's distributions of Levy processes

‎Suppose that $X_{t}$ is a one-dimensional and real-valued L'evy‎ ‎process started from $X_0=0$‎, ‎which ({bf 1}) its nonnegative‎ ‎jumps measure $nu$ satisfying $int_{Bbb‎ ‎R}min{1,x^2}nu(dx)

متن کامل

On optimal stationary couplings between stationary processes

By a classical result of Gray et al. (1975) the %̄ distance between stationary processes is identified with an optimal stationary coupling problem of the corresponding stationary measures on the infinite product spaces. This is a modification of the optimal coupling problem from Monge–Kantorovich theory. In this paper we derive some general classes of examples of optimal stationary couplings whi...

متن کامل

Approximation Resistance on Satisfiable Instances for Predicates Strictly Dominating Parity

In this paper, we study the approximability of Max CSP(P ) where P is a Boolean predicate. We prove that assuming Khot’s d-to-1 Conjecture, if the set of accepting inputs of P strictly contains all inputs with even (or odd) parity, then it is NP-hard to approximate Max CSP(P ) better than the simple random assignment algorithm even on satisfiable instances. This is a generalization of a work by...

متن کامل

On the Approximation of the Discrete Karhunen-loeve Transform for Stationary Processes

Suboptimal fast transforms are useful substitutes to the optimal Karhunen-Lo~ve transform (KLT). The selection of an efficient approximation for the KLT must be done with respect to some performance criterion that might differ from one application to another. A general class of criterion functions including most of the commonly used performance measures is introduced. They are shown to be optim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Mathematical Society of Japan

سال: 1960

ISSN: 0025-5645

DOI: 10.2969/jmsj/01220207